منابع مشابه
Optimal Sequential Search: A Bayesian Approach
To the classical model of searching for one object out of n , we add uncertainty about the parameters π of the distribution of the n objects among the m boxes. Adopting a Bayesian approach, we study the optimal sequential search strategy. For the case n = 1, we obtain a generalization of the fundamental result of Blackwell: the strategy which searches at each stage in the “most inviting” box is...
متن کاملFrom Optimal Search Theory to Sequential Paging in Cellular Networks
We propose a novel paging strategy based on the theory of optimal search with discrete efforts. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structures, and requires minimal...
متن کاملScalable, Parallel Best-First Search for Optimal Sequential Planning
Large-scale, parallel clusters composed of commodity processors are increasingly available, enabling the use of vast processing capabilities and distributed RAM to solve hard search problems. We investigate parallel algorithms for optimal sequential planning, with an emphasis on exploiting distributed memory computing clusters. In particular, we focus on an approach which distributes and schedu...
متن کاملFiltering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning systemwhich combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its own consistency rules and filtering and decomposition mechanisms suitable for planning. Given a fixed bound on the plan length, our planner works directly on a structure related to Graphplan’s planning graph. This struc...
متن کاملSequential File Prefetching In Linux
Sequential prefetching, also known as readahead in Linux, is a widely deployed technique to bridge the huge gap between the characteristics of storage devices and their inefficient ways of usage by applications. At one end, disk drives and disk arrays are better utilized by large accesses. At the other, applications tend to do lots of tiny sequential reads. To make the two ends meet, operating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1994
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90369-7